Three Arguments for Underspecified Representations
نویسندگان
چکیده
منابع مشابه
Completeness and Computational Efficiency for Underspecified Representations ∗
Cooper (1983) pioneered underspecified scope representation in formal and computational semantics through his introduction of quantifier storage into Montague semantics as an alternative to the syntactic operation of quantifying-in. In this paper we address an important issue in the development of an adequate formal theory of underspecified semantics. The tension between expressive power and co...
متن کاملFormal investigations of underspecified representations
In this thesis, two requirements on Underspecified Representation Formalisms are investigated in detail in the context of underspecification of scope. The requirement on partial disambiguation, stating that partially disambiguated ambiguities need to be represented, does not carry much content unless it has become clear, exactly what those ambiguities are. In line with König and Reyle (1999), I...
متن کاملRelaxing Underspecified Semantic Representations for Reinterpretation
Type and sort connicts in semantics are usually resolved by a process of reinterpretation. Recently, Egg (1999) has proposed an alternative account in which connicts are avoided by underspeciication. The main idea is to derive suuciently relaxed underspeciied semantic representations ; addition of reinterpretation operators then simply is further specialization. But in principle, relaxing under...
متن کاملOn the Expressive Completeness of Underspecified Representations
One property of underspecified representation formalisms is that of expressive completeness, i.e. the ability to provide representations for all possibly occuring sets of readings. In this paper a general and formal definition of completeness along the lines of [6] will be given. Several formalisms will then be compared concerning their expressive power and shown to be incomplete.
متن کاملNP Coordination in Underspecified Scope Representations
Accurately capturing the quantifier scope behaviour of coordinated NPs can be problematic for some underspecified semantic representations. We present an extension to hole semantics that allows a natural representation of sentences containing NP coordination, and which correctly captures the quantifiers’ scoping behaviour. We demonstrate that existing efficient algorithms developed to solve con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studies in Polish Linguistics
سال: 2019
ISSN: 1732-8160,2300-5920
DOI: 10.4467/23005920spl.19.020.11338